Isoperimetric inequalities for soluble groups
نویسندگان
چکیده
We approach the question of which soluble groups are automatic. We describe a class of nilpotent-by-abelian groups which need to be studied in order to answer this question. We show that the nilpotent-by-cyclic groups in this class have exponential isoperimetric inequality and so cannot be automatic.
منابع مشابه
An Isoperimetric Inequality for the Heisenberg Groups
We show that the Heisenberg groups H 2n+1 of dimension ve and higher, considered as Rieman-nian manifolds, satisfy a quadratic isoperimetric inequality. (This means that each loop of length L bounds a disk of area L 2). This implies several important results about isoperimetric inequalities for discrete groups that act either on H 2n+1 or on complex hyperbolic space, and provides interesting ex...
متن کاملIsoperimetric inequalities for nilpotent groups
We prove that every finitely generated nilpotent group of class c admits a polynomial isoperimetric function of degree c+1 and a linear upper bound on its filling length function. 1991 Mathematics Subject Classification: 20F05, 20F32, 57M07
متن کامل2 00 8 Mean time exit and isoperimetric inequalities for minimal submanifolds of N × R
Based on Markvorsen and Palmer's work on mean time exit and isoperimetric inequalities we establish slightly better isoperimetric inequalities and mean time exit estimates for minimal submanifolds of N × R. We also prove isoperimetric inequalities for submanifolds of Hadamard spaces with tamed second fundamental form.
متن کاملIsoperimetric inequalities for minimal graphs
Based on Markvorsen and Palmer work on mean time exit and isoperimetric inequalities we establish slightly better isoperimetric inequalities and mean time exit estimates for minimal graphs in N × R. We also prove isoperimetric inequalities for submanifolds of Hadamard spaces with tamed second fundamental form. Mathematics Subject Classification: (2000): Primary 53C42; Secondary 53A10
متن کاملThe Topology of Graph Products of Groups
Given a finite (connected) simplicial graph with groups assigned to the vertices, the graph product of the vertex groups is the free product modulo the relation that adjacent groups commute. The graph product of finitely presented infinite groups is both semistable at infinity and quasi-simply filtrated. Explicit bounds for the isoperimetric inequality and isodiametric inequality for graph prod...
متن کامل